A hybrid method for the nonlinear least squares problem with simple bounds
نویسندگان
چکیده
منابع مشابه
On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
We introduce an inexact Gauss-Newton trust-region method for solving bound-constrained nonlinear least-squares problems where, at each iteration, a trust-region subproblem is approximately solved by the Conjugate Gradient method. Provided a suitable control on the accuracy to which we attempt to solve the subproblems, we prove that the method has global and asymptotic fast convergence properties.
متن کاملLeast – Squares Method For Estimating Diffusion Coefficient
Abstract: Determination of the diffusion coefficient on the base of solution of a linear inverse problem of the parameter estimation using the Least-square method is presented in this research. For this propose a set of temperature measurements at a single sensor location inside the heat conducting body was considered. The corresponding direct problem was then solved by the application of the ...
متن کاملLEAST – SQUARES METHOD FOR ESTIMATING DIFFUSION COEFFICIENT
Determining the diffusion coefficient based on the solution of the linear inverse problem of the parameter estimation by using the Least-square method is presented. A set of temperature measurements at a single sensor location inside the heat conducting body is required. The corresponding direct problem will be solved by an application of the heat fundamental solution.
متن کاملOptimal backward perturbation bounds for the linear least squares problem
Dedicated to William Kahan and Beresford Parlett on the occasion of their 60th birthdays Let A be an m n matrix, b be an m-vector, and x̃ be a purported solution to the problem of minimizing kb Axk2. We consider the following open problem: find the smallest perturbation E of A such that the vector x̃ exactly minimizes kb (A+E)xk2. This problem is completely solved whenE is measured in the Frobeni...
متن کاملUsing an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1991
ISSN: 0377-0427
DOI: 10.1016/0377-0427(91)90023-d